Finite-State Unification Automata and Relational Languages

Finite-State Registered Automata and Their Uses in Natural Languages

We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expressions denote arbitrary FSRAs and use it to describe some morphological and phonological phenomena. We also define several dedicated operators which support an easy and efficient implementation of some non-trivial morph...

Regular Languages and Finite Automata

Regular Languages and Finite Automata

In 1943, McCulloch and Pitts [4] published a pioneering work on a model for studying the behavior of the nervous systems. Following up on the ideas of McCulloch and Pitts, Kleene [3] wrote the first paper on finite automata and regular expressions. A finite automaton can be considered as the simplest machine model in that the machine has a finite memory; that is, the memory size is independent ...

Efficient Finite State Unification Morphology

Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages

We investigate the average-case state and transition complexity of deterministic and nondeterministic finite automata, when choosing a finite language of given maximum word length n uniformly at random. The case where all words are of equal length is also taken into account. It is shown that almost all deterministic finite automata accepting finite languages over a binary input alphabet have st...